Alignment Elimination from Adams' Grammars

نویسنده

  • Härmel Nestra
چکیده

Adams’ extension of parsing expression grammars enables specifying indentation sensitivity using two non-standard grammar constructs — indentation by a binary relation and alignment. This paper proposes a step-by-step transformation of well-formed Adams’ grammars for elimination of the alignment construct from the grammar. The idea that alignment could be avoided was suggested by Adams but no process for achieving this aim has been described before. 1998 ACM Subject Classification D.3.1 Formal Definitions and Theory; D.3.4 Processors; F.4.2 Grammars and Other Rewriting Systems

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Systematic Comparison between Inversion Transduction Grammar and Linear Transduction Grammar for Word Alignment

We present two contributions to grammar driven translation. First, since both Inversion Transduction Grammar and Linear Inversion Transduction Grammars have been shown to produce better alignments then the standard word alignment tool, we investigate how the trade-off between speed and end-to-end translation quality extends to the choice of grammar formalism. Second, we prove that Linear Transd...

متن کامل

Sequence Alignment Guided By Common Motifs Described By Context Free Grammars

We introduce a new problem, context-free grammars (CFG)-guided pairwise sequence alignment, whose most immediate application is the alignment of RNA sequences that share motifs described by context-free grammars. Such motifs include common RNA secondary (sub)structures (such as stem-loops) that are recognizable in sequences. The problem aims to align given sequences by including, from a given s...

متن کامل

Hierarchical Phrase-Based Translation Grammars Extracted from Alignment Posterior Probabilities

We report on investigations into hierarchical phrase-based translation grammars based on rules extracted from posterior distributions over alignments of the parallel text. Rather than restrict rule extraction to a single alignment, such as Viterbi, we instead extract rules based on posterior distributions provided by the HMM word-to-word alignment model. We define translation grammars progressi...

متن کامل

On the Complexity of Alignment Problems in Two Synchronous Grammar Formalisms

The alignment problem for synchronous grammars in its unrestricted form, i.e. whether for a grammar and a string pair the grammar induces an alignment of the two strings, reduces to the universal recognition problem, but restrictions may be imposed on the alignment sought, e.g. alignments may be 1 : 1, island-free or sure-possible sorted. The complexities of 15 restricted alignment problems in ...

متن کامل

Inducing Translation Grammars from Bracketed Alignments

This paper presents an algorithm for generating and ltering an invertible and structural analogous translation grammar from bilingual aligned and linguistically bracketed texts. The algorithm is discussed in general terms and applied to German-English alignments. It is shown that the induction of structural analogous translation grammars can lead to disambiguation of meaning and correction of b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1706.06497  شماره 

صفحات  -

تاریخ انتشار 2017